Supplemental Note on Count-to-Infinity Induced Forwarding Loops in Ethernet Networks

نویسندگان

  • Khaled Elmeleegy
  • Alan L. Cox
  • T. S. Eugene Ng
چکیده

Ethernet forwarding loops are dangerous. Packets can be trapped in a loop and cause network congestion and instability. Furthermore, packet forwarding can be disrupted due to the pollution of forwarding tables. In this report, we show that the “count-to-infinity” behavior in Ethernet’s Rapid Spanning Tree Protocol (RSTP) can lead to a temporary forwarding loop. Additionally, we identify the causes for the formation of this forwarding loop: races between protocol control packets traversing the network, races between RSTP state machines, and nondeterminism within RSTP state machines. Finally, we present an annotated trace of RSTP events for an example network as an existential proof of the formation of a forwarding loop during count to infinity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Count-to-Infinity Induced Forwarding Loops in Ethernet Networks

Ethernet’s high performance, low cost and ubiquity have made it the dominant networking technology for many application domains. Unfortunately, its distributed forwarding topology computation protocol – the Rapid Spanning Tree Protocol (RSTP) – can suffer from a classic “count-to-infinity” problem that may lead to a forwarding loop under certain network failures. The consequences are serious. D...

متن کامل

Energy-Aware Probabilistic Epidemic Forwarding Method in Heterogeneous Delay Tolerant Networks

Due to the increasing use of wireless communications, infrastructure-less networks such as Delay Tolerant Networks (DTNs) should be highly considered. DTN is most suitable where there is an intermittent connection between communicating nodes such as wireless mobile ad hoc network nodes. In general, a message sending node in DTN copies the message and transmits it to nodes which it encounters. A...

متن کامل

Design an Efficient Community-based Message Forwarding Method in Mobile Social Networks

Mobile social networks (MSNs) are a special type of Delay tolerant networks (DTNs) in which mobile devices communicate opportunistically to each other. One of the most challenging issues in Mobile Social Networks (MSNs) is to design an efficient message forwarding scheme that has a high performance in terms of delivery ratio, latency and communication cost. There are two different approaches fo...

متن کامل

Routing with Metric-based Topology Investigation

As routing takes place in an entirely distributed system where local routers have no direct access to globally consistent network state information, a routing algorithm has to make uncertain forwarding decisions. As the network state may change, due to failures or new adoptions of networks, routing algorithms have to adapt themselves to the new situation. This network convergence phase should b...

متن کامل

A performance analysis of carrier Ethernet schemes based on Multiple Spanning Trees

Due to recent advances, Ethernet is starting to move from Local area networks to carrier networks. Nevertheless as the requirements of carrier networks are more demanding, the technology needs to be enhanced. Schemes designed for improving Ethernet to match carrier requirements can be categorized in two classes. The first class improves Ethernet control components only, and the second class imp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006